accepts the submission, but the caller can control only the maximum delay using the start timeout 執(zhí)行提交之前,可能會(huì)發(fā)生延遲,但是調(diào)用者只能控制最大延遲(用啟動(dòng)超時(shí))。
aimed at the quality of service required by real-time service, an effective bandwidth calculating method for self-similar traffic is presented to provide guaranteed packet loss probability and maximum delay 摘要針對(duì)多媒體實(shí)時(shí)業(yè)務(wù)需要提供特定服務(wù)質(zhì)量的情況,給出了一種能夠同時(shí)保證分組丟失概率和最大延時(shí)的自相似業(yè)務(wù)等效帶寬計(jì)算方法。
by using fractional brownian motion envelope process and additional maximum delay constrain, the algorithm overcomes the shortcoming of those packet-loss-probability based methods which can not guarantee the packet maximum delay 該算法采用分形布朗運(yùn)動(dòng)包絡(luò)過程對(duì)自相似業(yè)務(wù)進(jìn)行分析,通過增加最大延時(shí)約束條件,克服了原先基于分組丟失概率的有效帶寬計(jì)算方法不能保證業(yè)務(wù)最大延時(shí)要求的不足。
by using fractional brownian motion envelope process and additional maximum delay constrain, the algorithm overcomes the shortcoming of those packet-loss-probability based methods which can not guarantee the packet maximum delay 該算法采用分形布朗運(yùn)動(dòng)包絡(luò)過程對(duì)自相似業(yè)務(wù)進(jìn)行分析,通過增加最大延時(shí)約束條件,克服了原先基于分組丟失概率的有效帶寬計(jì)算方法不能保證業(yè)務(wù)最大延時(shí)要求的不足。
this algorithm begins with yielding a least-cost spanning tree . then check every path from source to destination . if one path beyond the maximum delay, replace it with least-delay path in order to satisfying the delay bounded 該算法在構(gòu)造滿足時(shí)延約束的組播樹過程中,先構(gòu)造最小生成樹作為初始樹,然后以時(shí)延最小路徑代替樹中的時(shí)延越界路徑,直至樹的根節(jié)點(diǎn)到所有目的節(jié)點(diǎn)的路徑滿足時(shí)延要求。